An Exact Weaving Rasterization Algorithm For Digital Planes
نویسنده
چکیده
In this paper a new 3D plane rasterization algorithm based on weaving techniques is presented. This algorithm uses the coherence present in 3D parallel lines within the plane. Parallel lines have the same cyclic Freeman chain code but shifted by a parameter. This article provides the theory to determine this shift parameter.
منابع مشابه
Supercover plane rasterization - a rasterization algorithm for generating supercover plane inside a cube
An analysis of a rasterization algorithm for generating supercover planes in 3D voxel space is presented. The derived algorithm is an extension to the classical 2D line rasterization algorithm. Additional voxels needed to form the supercover 3D plane are identified by rasterizing two additional 2D lines per volume slice. A discussion on how to modify the algorithm to rasterize finite supercover...
متن کاملPolygon Rendering for Interactive Visualization on Multicomputers
This dissertation identifies a class of parallel polygon rendering algorithms suitable for interactive use on multicomputers, and presents a methodology for designing efficient algorithms within that class. The methodology was used to design a new polygon rendering algorithm that uses the frame-to-frame coherence of the screen image to evenly partition the rasterization at reasonable cost. An i...
متن کاملHyperplane Culling for Stochastic Rasterization
We present two novel culling tests for rasterization of simultaneous depth of field and motion blur. These tests efficiently reduce the set of xyuvt samples that need to be coverage tested within a screen space tile. The first test finds linear bounds in utand vt-space using a separating line algorithm. We also derive a hyperplane in xyuvtspace for each triangle edge, and all samples outside of...
متن کاملImmediate-mode Ray-casting Immediate-mode Ray-casting
We propose a simple modi cation to the classical polygon rasterization pipeline that enables exact, e cient raycasting of bounded implicit surfaces without the use of a global spatial data structure or bounding hierarchy. Our algorithm requires two descriptions for each object: a (possibly non-convex) polyhedral bounding volume, and an implicit equation (including, optionally, a number of clipp...
متن کاملMIT LCS TR - 8 XX Immediate - Mode Ray - Casting
We propose a simple modiication to the classical polygon rasterization pipeline that enables exact, eecient raycasting of bounded implicit surfaces without the use of a global spatial data structure or bounding hierarchy. Our algorithm requires two descriptions for each object: a (possibly non-convex) polyhedral bounding volume, and an implicit equation (including, optionally, a number of clipp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999